منابع مشابه
MDD Propagation for Sequence Constraints
We study propagation for the sequence constraint in the context of constraint programming based on limited-width MDDs. Our first main contribution is proving that establishing MDD-consistency for sequence is NP-hard. Second, we propose a partial filtering algorithm that relies on a specific decomposition of the constraint and a novel extension of MDD filtering to node domains. Finally, we exper...
متن کاملMDD Propagation for Disjunctive Scheduling
Disjunctive scheduling is the problem of scheduling activities that must not overlap in time. Constraint-based techniques, such as edge finding and not-first/not-last rules, have been a key element in successfully tackling large and complex disjunctive scheduling problems in recent years. In this work we investigate new propagation methods based on limited-width Multivalued Decision Diagrams (M...
متن کاملBuilding efficient soft and cost MDD constraints
Recent developments of efficient propagators, operations and creation methods for MDDs allow us to directly build efficient MDD-based models, without the need of intermediate data structures. In this paper, we make another step in this direction by defining efficient methods to handle cost and soft versions of the MDD constraint. First, we improve the existing algorithms, then we propose to per...
متن کاملImproving GAC-4 for Table and MDD Constraints
We introduce GAC-4R, MDD-4, and MDD-4R three new algorithms for maintaining arc consistency for table and MDD constraints. GAC-4R improves the well-known GAC-4 algorithm by managing the internal data structures in a different way. Instead of maintaining the internal data structures only by studying the consequences of deletions, we propose to reset the data structures by recomputing them from s...
متن کاملConsistency Propagation for Stretch Constraints
Scheduling and rostering problems are among the most common applications of constraint programming. In this thesis, we explore several global constraints for rostering problems. We demonstrate algorithms for efficiently enforcing domain consistency for these constraints, and show empirically that achieving this strongest possible level of consistency is not only of theoretical interest, but als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2014
ISSN: 1076-9757
DOI: 10.1613/jair.4199